Minimization of Logic Functions Using Essential Signature Sets
نویسندگان
چکیده
We present a new algorithm for exact two-level logic optimization. It diiers from the classical approach; rather than generating the set of all prime implicants of a function, and then deriving a covering problem, we derive the covering problem directly and implicitly , and then generate only those primes involved in the covering problem. We represent a set of primes by the cube of their intersection. The set of sets of primes which forms the covering problem is unique. Hence the corresponding set of cubes forms a canon-ical cover. We give a successive reduction algorithm for nding the canonical cover from any initial cover, we then generate only those primes involved in at least one minimal cover. The method is eeective; solutions for 10 of the 20 hard examples in the Espresso benchmark set are derived and proved minimum. For 5 of the remaining examples the canonical cover is derived, but the covering problem remains to be solved exactly.
منابع مشابه
An Approach for Accurate Edging using Dynamic Membership Functions
In this paper, by means of fuzzy approaches, an accurate method is introduced for edging of color photographs. The difference between our method with other similar methods is the use of a morphological operation to think or thick the obtained edges. In this proposed method, a 3×3 window is dragged on the photo. For each block, 12 point sets will be defined, each including two non-overlapping po...
متن کاملLogic Synthesis for Disjunctions of Boolean Functions
This paper develops theoretical foundations and presents a practical algorithm for optimizing multi-output Boolean function M(x) whose outputs are combined using Boolean OR operator into a single-output Boolean function S(x). The proposed algorithm simplifies the logic structure of function M(x) and may change or remove some of its outputs, while preserving the functionality of function S(x). A...
متن کاملINTERSECTION OF ESSENTIAL IDEALS IN THE RING OF REAL-VALUED CONTINUOUS FUNCTIONS ON A FRAME
A frame $L$ is called {it coz-dense} if $Sigma_{coz(alpha)}=emptyset$ implies $alpha=mathbf 0$. Let $mathcal RL$ be the ring of real-valued continuous functions on a coz-dense and completely regular frame $L$. We present a description of the socle of the ring $mathcal RL$ based on minimal ideals of $mathcal RL$ and zero sets in pointfree topology. We show that socle of $mathcal RL$ is an essent...
متن کاملMinimization Algorithms for Multiple-Valued Programmable Logic Arrays
We analyze the performance of various heuristic algorithms for minimizing realizations of multiple-valued functions by the newly developed CCD 191 and CMOS [W] programmable logic arrays. The functions realized by such PLA's are in sum-of-products form, where sum is ordinary addition truncated to the highest logic value, and where product represents the MIN operation on functions of the input va...
متن کاملIntellectual Property Protection by Watermarking Combinational Logic Synthesis Solutions
Recently, design reuse has emerged as a dominant integrated system design and integration paradigm. However, the intellectual property (IP) business model is vulnerable to a number of potentially devastating obstructions, such as misappropriation and intellectual property fraud. We propose a new method for IP protection (IPP) which facilitates design watermarking at the combinational logic synt...
متن کامل